A computer checked algebraic verification of a distributed summation algorithm

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic verification of a distributed summation algorithm

In this note we present an algebraic veriication of Segall's Propagation of Information with Feedback (PIF) algorithm. This algorithm serves as a nice benchmark for veriication exercises (see 2, 13, 8]). The veriication is based on the methodology presented in 7] and demonstrates its applicability to distributed algorithms.

متن کامل

RAPPORT Verification of a distributed summation algorithm

A correctness proof of a variant of Segall's Propagation of Information with Feedback protocol is presented. The proof, which is carried out within the I/O automata model of Lynch and Tuttle, is standard except for the use of a prophecy variable. The aim of this paper is to show that, unlike what has been suggested in the literature, assertional methods based on invariant reasoning support an i...

متن کامل

A Computer-Checked Verification of Milner's Scheduler

We present an equational veriication of Milner's scheduler, which we checked by computer. To our knowledge this is the rst time that the scheduler is proof-checked for a general number n of scheduled processes.

متن کامل

Formal Verification of a Distributed Computer System

Modeling distributed computer systems is known to be a challenging enterprise. Typically, distributed systems are comprised of large numbers of components whose coordination may require complex interactions. Modeling such systems more often than not leads to the nominal intractability of the resulting state space. Various formal methods have been proposed to address the modeling of coordination...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Formal Aspects of Computing

سال: 2005

ISSN: 0934-5043,1433-299X

DOI: 10.1007/s00165-004-0052-7